<?xml version="1.0" encoding="ISO-8859-1"?>
<metadatalist>
	<metadata ReferenceType="Conference Proceedings">
		<site>sibgrapi.sid.inpe.br 802</site>
		<holdercode>{ibi 8JMKD3MGPEW34M/46T9EHH}</holdercode>
		<identifier>6qtX3pFwXQZeBBx/CKuEQ</identifier>
		<repository>sid.inpe.br/banon/2004/07.13.15.32</repository>
		<lastupdate>2004:07.13.03.00.00 sid.inpe.br/banon/2001/03.30.15.38 administrator</lastupdate>
		<metadatarepository>sid.inpe.br/banon/2004/07.13.15.32.52</metadatarepository>
		<metadatalastupdate>2022:09.13.03.49.01 sid.inpe.br/banon/2001/03.30.15.38 administrator {D 2004}</metadatalastupdate>
		<doi>10.1109/SIBGRA.2004.1352963</doi>
		<citationkey>MartinezVelhCarv:2004:GePaTr</citationkey>
		<title>Geodesic Paths on Triangular Meshes</title>
		<format>On-line</format>
		<year>2004</year>
		<numberoffiles>1</numberoffiles>
		<size>8843 KiB</size>
		<author>Martinez, Dimas,</author>
		<author>Velho, Luiz Carlos Pacheco Rodrigues,</author>
		<author>Carvalho, Paulo Cezar,</author>
		<affiliation>IMPA</affiliation>
		<editor>Araújo, Arnaldo de Albuquerque,</editor>
		<editor>Comba, João Luiz Dihl,</editor>
		<editor>Navazo, Isabel,</editor>
		<editor>Sousa, Antônio Augusto de,</editor>
		<e-mailaddress>dimasmm@impa.br</e-mailaddress>
		<conferencename>Brazilian Symposium on Computer Graphics and Image Processing, 17 (SIBGRAPI) - Ibero-American Symposium on Computer Graphics, 2 (SIACG)</conferencename>
		<conferencelocation>Curitiba, PR, Brazil</conferencelocation>
		<date>17-20 Oct. 2004</date>
		<publisher>IEEE Computer Society</publisher>
		<publisheraddress>Los Alamitos</publisheraddress>
		<booktitle>Proceedings</booktitle>
		<tertiarytype>Full Paper</tertiarytype>
		<transferableflag>1</transferableflag>
		<versiontype>finaldraft</versiontype>
		<keywords>Geodesic Curve, Discrete Geodesic, Triangular Mesh.</keywords>
		<abstract>We present a new algorithm to compute a geodesic path over a triangulated surface. Based in Sethian's Fast Marching Method and Polthier's Straightest Geodesics theory, we are able to generate an iterative process to obtain a good discrete geodesic approximation. It can handle convex and non-convex surfaces as well.</abstract>
		<language>en</language>
		<targetfile>4381_Martinez_D.ps</targetfile>
		<usergroup>dimas administrator</usergroup>
		<visibility>shown</visibility>
		<nexthigherunit>8JMKD3MGPEW34M/46QM2BE</nexthigherunit>
		<nexthigherunit>8JMKD3MGPEW34M/4742MCS</nexthigherunit>
		<citingitemlist>sid.inpe.br/sibgrapi/2022/05.03.00.29 9</citingitemlist>
		<hostcollection>sid.inpe.br/banon/2001/03.30.15.38</hostcollection>
		<lasthostcollection>sid.inpe.br/banon/2001/03.30.15.38</lasthostcollection>
		<url>http://sibgrapi.sid.inpe.br/rep-/sid.inpe.br/banon/2004/07.13.15.32</url>
	</metadata>
</metadatalist>